99 research outputs found

    Programma di Teoria dei Numeri 1

    Get PDF

    The Eulerian numbers on restricted centrosymmetric permutations

    Full text link
    We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, Ï„=123\tau=123 and nn even, is a bijection that associates a Dyck prefix of length 2n2n to every centrosymmetric permutation in S2nS_{2n} that avoids 123.Comment: 17 pages, 6 figure

    Combinatorial properties of the numbers of tableaux of bounded height

    Get PDF
    We introduce an infinite family of lower triangular matrices ¡(s), where °s n;i counts the standard Young tableaux on n cells and with at most s columns on a suitable subset of shapes. We show that the entries of these matrices satisfy a three-term row recurrence and we deduce recursive and asymptotic properties for the total number ¿s(n) of tableaux on n cells and with at most s columns

    Two permutation classes enumerated by the central binomial coefficients

    Full text link
    We define a map between the set of permutations that avoid either the four patterns 3214,3241,4213,42313214,3241,4213,4231 or 3124,3142,4123,41323124,3142,4123,4132, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a bijection that allows us to determine some notable features of these permutations, such as the distribution of the statistics "number of ascents", "number of left-to-right maxima", "first element", and "position of the maximum element"Comment: 26 pages, 3 figure

    Descent sets on 321-avoiding involutions and hook decompositions of partitions

    Full text link
    We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside an n/2 by n/2 box. We also obtain a refinement that keeps track of the descent set, and we deduce an analogous result for the comajor index of 123-avoiding involutions
    • …
    corecore